Analysis of Nonblocking ATM Switches
نویسندگان
چکیده
An analytical model for the performance analysis of a multiple input queued asynchronous transfer mode (ATM) switch is presented in this paper. The interconnection network of the ATM switch is internally nonblocklng and each input port malntahts a separate queue of cells for each output port The switch uses parallel iterative matching (PIM) [7] to Ford the maxlmal matching between the input and output ports of the switch. A closed-form solution for the maxhnm throughput of the switch under saturated conditions is derived. It is found that the maxlmmn throughput of the switch exceeds 99% with just four iterations of the PlM algorithm. Using the tugged input queue approach, an analytical model for evahtathtg the switch performance under an independent identically distributed Bernoulli trafllc with the cell destinations uniformly distributed over all output ports is developed. The switch throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verilled using simulation.
منابع مشابه
Fast Cell Loss Rate Estimation of ATM Switches Using Importance Sampling
The performance evaluation of A T M switches is of paramount importance in designing an A T M network. In this paper, we focus on the evaluation of the cell loss rate (CLR) in nonblocking ATM switches using computer simulations. In particular, we investigate the potential of using importance sampling techniques as an “superfast” alternative to conventional Monte Carlo simulation in finding the ...
متن کاملSurvey of Switching Techniques in High-Speed Networks and Their Performance
One of the most promising approaches for high speed networks for integrated service applications is fast packet switching, or ATM (Asynchronous Transfer Mode). ATM can be characterized by very high speed transmission links and simple, hardwired protocols within a network. To match the transmission speed of the network links, and to minimize the overhead due to the processing of network protocol...
متن کاملApproximation Algorithms for Connguring Hierarchical Nonblocking Communication Networks
A framework is given for specifying nonblocking traac limits in a connection-oriented communications network. In this framework, connections may be point-to-point or multipoint, and the data rates may vary from one connection to another. The traac limits may be \\at", or they may also be hierarchical, representing communities of interest within the network that have higher traac among themselve...
متن کاملApproximation Algorithms for Con guring Hierarchical Nonblocking Communication Networks
A framework is given for specifying nonblocking tra c limits in a connectionoriented communications network. In this framework, connections may be point-topoint or multipoint, and the data rates may vary from one connection to another. The tra c limits may be \ at", or they may also be hierarchical, representing communities of interest within the network that have higher tra c among themselves ...
متن کاملDesign of Nonblocking ATM Networks
This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link c...
متن کامل